runtime.addrRanges.ranges (field)
62 uses
runtime (current package)
mpagealloc_64bit.go#L164: need = need.subtract(addrRangeToSumAddrRange(l, p.inUse.ranges[inUseIndex-1]))
mpagealloc_64bit.go#L166: if inUseIndex < len(p.inUse.ranges) {
mpagealloc_64bit.go#L167: need = need.subtract(addrRangeToSumAddrRange(l, p.inUse.ranges[inUseIndex]))
mranges.go#L156: ranges []addrRange
mranges.go#L167: ranges := (*notInHeapSlice)(unsafe.Pointer(&a.ranges))
mranges.go#L184: bot, top := 0, len(a.ranges)
mranges.go#L187: if a.ranges[i].contains(base.addr()) {
mranges.go#L192: if base.lessThan(a.ranges[i].base) {
mranges.go#L210: if base.lessThan(a.ranges[i].base) {
mranges.go#L225: return a.ranges[0].base.addr(), true
mranges.go#L227: if a.ranges[i-1].contains(addr) {
mranges.go#L230: if i < len(a.ranges) {
mranges.go#L231: return a.ranges[i].base.addr(), true
mranges.go#L242: return a.ranges[i-1].contains(addr)
mranges.go#L267: coalescesDown := i > 0 && a.ranges[i-1].limit.equal(r.base)
mranges.go#L268: coalescesUp := i < len(a.ranges) && r.limit.equal(a.ranges[i].base)
mranges.go#L272: a.ranges[i-1].limit = a.ranges[i].limit
mranges.go#L275: copy(a.ranges[i:], a.ranges[i+1:])
mranges.go#L276: a.ranges = a.ranges[:len(a.ranges)-1]
mranges.go#L280: a.ranges[i-1].limit = r.limit
mranges.go#L284: a.ranges[i].base = r.base
mranges.go#L288: if len(a.ranges)+1 > cap(a.ranges) {
mranges.go#L293: oldRanges := a.ranges
mranges.go#L294: ranges := (*notInHeapSlice)(unsafe.Pointer(&a.ranges))
mranges.go#L300: copy(a.ranges[:i], oldRanges[:i])
mranges.go#L301: copy(a.ranges[i+1:], oldRanges[i:])
mranges.go#L303: a.ranges = a.ranges[:len(a.ranges)+1]
mranges.go#L304: copy(a.ranges[i+1:], a.ranges[i:])
mranges.go#L306: a.ranges[i] = r
mranges.go#L315: if len(a.ranges) == 0 {
mranges.go#L318: r := a.ranges[len(a.ranges)-1]
mranges.go#L322: a.ranges[len(a.ranges)-1].limit = newEnd
mranges.go#L326: a.ranges = a.ranges[:len(a.ranges)-1]
mranges.go#L338: a.ranges = a.ranges[:0]
mranges.go#L342: for _, r := range a.ranges[pivot:] {
mranges.go#L345: if r := a.ranges[pivot-1]; r.contains(addr) {
mranges.go#L352: a.ranges[pivot-1] = r
mranges.go#L355: a.ranges = a.ranges[:pivot]
mranges.go#L362: if len(a.ranges) > cap(b.ranges) {
mranges.go#L364: ranges := (*notInHeapSlice)(unsafe.Pointer(&b.ranges))
mranges.go#L366: ranges.cap = cap(a.ranges)
mranges.go#L369: b.ranges = b.ranges[:len(a.ranges)]
mranges.go#L371: copy(b.ranges, a.ranges)